How good are convex hull algorithms?
نویسندگان
چکیده
منابع مشابه
Incremental Convex Hull Algorithms Are Not Output Sensitive
A polytope is the bounded intersection of a nite set of halfspaces of R d. Every polytope can also be represented as the convex hull conv V of its vertices (or extreme points) V. The convex hull problem is to convert from the vertex representation to the halfspace representation or (equivalently by geometric duality) vice-versa. Given an ordering v 1 : : : v n of the input vertices, after some ...
متن کاملEfficient Parallel Convex Hull Algorithms
A bstract-In this paper, we present parallel algorithms to identifv (i.e., detect and enumerate) the extreme points of the convex hull of a set of planar points using a hypercube, pyramid, tree, mesh-of-trees, mesh with reconfigurable bus, EREW PRAM, and a modified AKS network. It is known that the problem of identifying the convex hull for a set of planar points given arbitrarily cannot be sol...
متن کاملHow Good Are Association-Rule Mining Algorithms?
We address the question of how much space remains for performance improvement over current association rule mining algorithms. Our approach is to compare their performance against an “Oracle algorithm” that knows in advance the identities of all frequent itemsets in the database and only needs to gather the actual supports of these itemsets, in one scan over the database, to complete the mining...
متن کاملSpace-efficient planar convex hull algorithms
A space-efficient algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. We describe four space-efficient algorithms for computing the convex hull of a planar point set.
متن کاملIn-Place Planar Convex Hull Algorithms
An in-place algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. In this paper we describe three in-place algorithms for computing the convex hull of a planar point set. All three algorithms are optimal, some more so than others. . .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1997
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(96)00023-5